全文获取类型
收费全文 | 78篇 |
免费 | 2篇 |
国内免费 | 2篇 |
专业分类
化学 | 4篇 |
力学 | 1篇 |
综合类 | 2篇 |
数学 | 74篇 |
物理学 | 1篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2018年 | 3篇 |
2016年 | 2篇 |
2014年 | 3篇 |
2013年 | 2篇 |
2012年 | 3篇 |
2011年 | 4篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 2篇 |
2004年 | 1篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有82条查询结果,搜索用时 93 毫秒
1.
郭飞 《应用数学与计算数学学报》1997,11(1):19-26
Wilson,Han和Powell提出的序列二次规划方法(简称SQP方法)是求解非线性规划问题的一个著名方法,这种方法每次迭代的搜索方向是通过求解一个二次规划子问题得到的,本文受[1]启发,得到二次规划子问题的一个近似解,进而给出了一类求解线性约束非线性规划问题的可行方向法,在约束集合满足正则性的条件下,证明了该算法对五种常用线性搜索方法具有全局收敛性。 相似文献
2.
3.
We give a linear-time algorithm to find a feasible flow in a strongly connected network with fixed supplies and demands, each summing to a common value that is at most the minimum arc capacity. This algorithm speeds up the Goldberg-Rao maximum flow method by a constant factor. 相似文献
4.
5.
杨启帆 《高校应用数学学报(A辑)》1998,13(2):193-196
此文考察工时依赖于开工时间的排序问题.文章证明:(1)即使准奋时间完全相同,判断工时与开工时间相关的单台机排序问题是否有可行解也是NP完全的.(2)即使只存在两个不同的截止期,判断工时与开工时间相关的单台机排序问题是否有可行解仍然是NP完全的.(3)当所有工件有相同截止期时,问题是否有可行解可在多项式时间内判定. 相似文献
6.
Incorporating further information into the ordered weighted averaging (OWA) operator weights is investigated in this paper. We first prove that for a constant orness the minimax disparity model [13] has unique optimal solution while the modified minimax disparity model [16] has alternative optimal OWA weights. Multiple optimal solutions in modified minimax disparity model provide us opportunity to define a parametric aggregation OWA which gives flexibility to decision makers in the process of aggregation and selecting the best alternative. Finally, the usefulness of the proposed parametric aggregation method is illustrated with an application in metasearch engine. 相似文献
7.
8.
M. C. Cheng 《Mathematical Programming》1985,31(2):229-234
The standard linear program with known finite optimum value is considered. New theorems for identifying permanent basic and
non-basic variables are derived which generalize and unify many existing approaches. These theorems also provide a powerful
theoretical basis for identifying many more permanent basic and nonbasic variables which are otherwise not identifiable under
existing approaches. 相似文献
9.
Elmor L. Peterson 《Mathematical Programming》1977,12(1):392-405
F.E. Clark has shown that if at least one of the feasible solution sets for a pair of dual linear programming problems is nonempty then at least one of them is both nonempty and unbounded. Subsequently, M. Avriel and A.C. Williams have obtained the same result in the more general context of (prototype posynomial) geometric programming. In this paper we show that the same result is actually false in the even more general context of convex programming — unless a certain regularity condition is satisfied.We also show that the regularity condition is so weak that it is automatically satisfied in linear programming (prototype posynomial) geometric programming, quadratic programming (with either linear or quadratic constraints),l
p
-regression analysis, optimal location, roadway network analysis, and chemical equilibrium analysis. Moreover, we develop an equivalent regularity condition for each of the usual formulations of duality.Research sponsored by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR-73-2516. 相似文献
10.
M. J. D. Powell 《Mathematical Programming》1981,20(1):353-357
An example shows that, if in Rosen's [4] algorithm for calculating a point that satisfies linear constraints a natural criterion is used to select constraints to delete from active sets, then the algorithm may cycle instead of converging. There are no degeneracies in the example. 相似文献